Parallel Processing for Scanning Genomic Data
نویسنده
چکیده
The scan of a genomic database aims to detect similarities between dna or protein sequences. This is a time-consuming operation, especially when weak similarities are searched. Speeding up the scan can be managed using various strategies of paralleliza-tion. This paper presents two approaches carried on at irisa: systolic and distributed parallelization.
منابع مشابه
Parallel Processing for Scanning Genomic Data-Bases
The scan of a genomic database aims to detect similarities between dna or protein sequences. This is a time-consuming operation, especially when weak similarities are searched. Speeding up the scan can be managed using various strategies of paralleliza-tion. This paper presents two approaches carried on at irisa: systolic and distributed parallelization.
متن کاملParleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملCluster of re-configurable nodes for scanning large genomic banks
Genomic data are growing exponentially and are daily searched by thousands of biologists. To reduce the search time, efficient parallelism can be exploited by dispatching data among a cluster of processing units able to scan locally and independently their own data. If PC clusters are well suited to support this type of parallelism, we propose to substitute PCs by reconfigurable hardware closel...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملEvaluation of scheduling solutions in parallel processing using DEA FDH model
This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
متن کامل